Building Opponent Model in Imperfect Information Board Games
نویسندگان
چکیده
In imperfect information problems, board game is a class of special problem that differs from card games like poker. Several characters make it a valuable test bed for opponent modeling, which is one of the most difficult problems in artificial intelligence decision systems. In card games, opponent modeling has proved its importance on improving agents’ strength. In this paper, a method of building opponent models in imperfect information board games is introduced systematically. Formalized evaluation method of arrangement strength in board game in proposed. Risk dominance is suggest as the classified criterion of building opponent models and basing that, classified primary probability tables are built as opponent models. Last, Siguo game is chosen as the application for opponent modeling and shows its advantages in the experiments.
منابع مشابه
Robust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملGame theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opponent model by combining information from a precomputed equilibrium strategy with the observations. It then computes and plays a best response to this opponent model; the opponent model and best response are both updated...
متن کاملOverconfidence or Paranoia? Search in Imperfect-Information Games
We derive a recursive formula for expected utility values in imperfectinformation game trees, and an imperfectinformation game tree search algorithm based on it. The formula and algorithm are general enough to incorporate a wide variety of opponent models. We analyze two opponent models. The “paranoid” model is an information-set analog of the minimax rule used in perfect-information games. The...
متن کاملBayesian Opponent Exploitation in Imperfect-Information Games
Two fundamental problems in computational game theory are computing a Nash equilibrium and learning to exploit opponents given observations of their play (opponent exploitation). The latter is perhaps even more important than the former: Nash equilibrium does not have a compelling theoretical justification in game classes other than two-player zero-sum, and for all games one can potentially do ...
متن کاملThe Effectiveness of Opponent Modelling in a Small Imperfect Information Game Contents
Opponent modelling is an important issue in games programming today. Programs which do not perform opponent modelling are unlikely to take full advantage of the mistakes made by an opponent. Additionally, programs which do not adapt over time become less of a challenge to players, causing these players to lose interest. While opponent modelling can be a difficult challenge in perfect informatio...
متن کامل